Divisibility of polynomials over finite fields and combinatorial applications

نویسندگان

  • Daniel Panario
  • Olga Sosnovski
  • Brett Stevens
  • Qiang Wang
چکیده

Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finite field. The set of its subintervals is a linear code whose dual code is formed by all polynomials divisible by f . Since the minimum weight of dual codes is directly related to the strength of the corresponding orthogonal arrays, we can produce orthogonal arrays by studying divisibility of polynomials. Munemasa (Finite Fields Appl., 4(3):252-260, 1998) uses trinomials over F2 to construct orthogonal arrays of guaranteed strength 2 (and almost strength 3). That result was extended by Dewar et al. (Des. Codes Cryptogr., 45:1-17, 2007) to construct orthogonal arrays of guaranteed strength 3 by considering divisibility of trinomials by pentanomials over F2. Here we first simplify the requirement in Munemasa’s approach that the characteristic polynomial of the sequence must be primitive: we show that the method applies even to the much broader class of polynomials with no repeated roots. Then we give characterizations of divisibility for binomials and trinomials over F3. Some of our results apply to any finite field Fq with q elements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Properties of Generalized Self-reciprocal Polynomials over Finite Fields

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to aself reciprocal polynomials defined in [4]. We consider the properties for the divisibility of a-reciprocal polynomials, estimate the number of all nontrivial a-self reciprocal irreducible monic polynomials and characterize the parity of the number of irreducible f...

متن کامل

Some finite groups with divisibility graph containing no triangles

Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...

متن کامل

On divisibility of exponential sums of polynomials of special type over fields of characteristic 2

We study divisibility by eight of exponential sums of several classes of functions over finite fields of characteristic two. For the binary classical Kloosterman sums K(a) over such fields we give a simple recurrent algorithm for finding the largest k, such that 2 divides the Kloosterman sum K(a). This gives a simple description of zeros of such Kloosterman sums.

متن کامل

The divisibility modulo 24 of Kloosterman sums on GF(2m), m even

In a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums K(a) over a finite field F2m with m even were evaluated modulo 24 in the case m odd, and the number of those a giving the same value for K(a) modulo 24 was given. In this paper the same is done in the case m even. The key techniques used in this paper are different from those used in the aforementioned work. In particular, we...

متن کامل

Random Polynomials over Finite Fields: Statistics and Algorithms

Polynomials appear in many research articles of Philippe Flajolet. Here we concentrate only in papers where polynomials play a crucial role. These involve his studies of the shape of random polynomials over finite fields, the use of these results in the analysis of algorithms for the factorization of polynomials over finite fields, and the relation between the decomposition into irreducibles of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2012